Upper Bounds on the Number of Codewords of Some Separating Codes
نویسندگان
چکیده
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Sil-verberg's question holds true for almost all Reed-Solomon codes.
منابع مشابه
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density paritycheck (LDPC) codes, and are well investigated in coding theory. In this paper, we make connections between cages and trapping sets. In particular, starting from a cage (or a modified cage), we c...
متن کاملBounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes
In this paper, we are concerned about optimal (v, 4, 3, 2)-OOCs. A tight upper bound on the exact number of codewords of optimal (v, 4, 3, 2)-OOCs and some direct and recursive constructions of optimal (v, 4, 3, 2)-OOCs are given. As a result, the exact number of codewords of an optimal (v, 4, 3, 2)-OOC is determined for some infinite series. C © 2013 Wiley Periodicals, Inc. J. Combin. Designs ...
متن کاملBounds on Minimal Codewords in Linear Codes
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal code-words are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every weight class between the two bounds contains at least one minimal codeword and at least one non-mi...
متن کاملFurther results on the covering radius of codes
A number of upper and lower bounds are obtained for K( n, R), the minimal number of codewords in any binary code of length n and covering radius R. Several new constructions are used to derive the upper bounds, including an amalgamated direct sum construction for nonlinear codes. This construction works best when applied to normal codes, and we give some new and stronger conditions which imply ...
متن کاملOn the intersection of additive perfect codes
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and upper bounds for the intersection number are computed and, for any value between these bounds, codes which have this given intersection value are constructe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1208.2076 شماره
صفحات -
تاریخ انتشار 2012